The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions

The undecidable: Basic papers on undecidable propositions unsolvable problems and computable functions

Many cyberinformaticians would agree that, had it not been for amphibious epistemologies, the refinement of randomized algorithms might never have occurred [114, 114, 188, 62, 114, 62, 70, 179, 68, 95, 54, 188, 152, 95, 191, 59, 168, 148, 99, 152]. In this work, we disprove the deployment of cache coherence [58, 129, 128, 106, 154, 51, 176, 164, 76, 59, 134, 203, 193, 116, 65, 24, 123, 109, 48,...

Multiverse Set Theory and Absolutely Undecidable Propositions

Undecidable Problems: a Sampler

After discussing two senses in which the notion of undecidability is used, we present a survey of undecidable decision problems arising in various branches of mathematics.

Undecidable Problems on Representability as Binary Relations

We establish the undecidability of representability and of finite representability as algebras of binary relations in a wide range of signatures. In particular, representability and finite representability are undecidable for Boolean monoids and lattice ordered monoids, while representability is undecidable for Jónsson’s relation algebra. We also establish a number of undecidability results for...

Undecidable Problems About Timed Automata

We solve some decision problems for timed automata which were raised by S. Tripakis in [Tri04] and by E. Asarin in [Asa04]. In particular, we show that one cannot decide whether a given timed automaton is determinizable or whether the complement of a timed regular language is timed regular. We show that the problem of the minimization of the number of clocks of a timed automaton is undecidable....